graph structure theoremの例文
もっと例文: 1 2
- Unfortunately, this notion of " good reason " is not sophisticated enough for the graph structure theorem.
- When " H " is not planar, the graph structure theorem may be looked at as a vast generalization of the Kuratowski theorem.
- This is one reason that the graph structure theorem is said to describe the " rough structure " of " H "-free graphs.
- Apex-minor-free graph families obey a strengthened version of the graph structure theorem, leading to additional approximation algorithms for graph coloring and the travelling salesman problem.
- And in yet other contexts, such as the graph structure theorem for minor-closed families of simple graphs, it is natural to allow the set of removed edges to be specified as part of the operation.